package leetcode.weekly.week327;

//Solution1Test
public class Solution1 {

	public int maximumCount(int[] nums) {
		int a = 0, b = 0;
		for (int num : nums) {
			if (num > 0) {
				a += 1;
			} else if (num < 0) {
				b += 1;
			}
		}
		return Math.max(a, b);
	}
}
